Bitonic Sorting Algorithm: A Review
نویسندگان
چکیده
منابع مشابه
A Adaptive Bitonic Sorting
Definition Adaptive bitonic sorting is a sorting algorithm suitable for implementation on EREW parallel architectures. Similar to bitonic sorting, it is based onmerging, which is recursively applied to obtain a sorted sequence. In contrast to bitonic sorting, it is data-dependent. Adap tive bitonic merging can be performed inO( p ) parallel time, p being the number of processors, ...
متن کاملAdaptive Bitonic Sorting∗
Adaptive bitonic sorting is a sorting algorithm suitable for implementation on EREW parallel architectures. Similar to bitonic sorting, it is based on merging, which is recursively applied to obtain a sorted sequence. In contrast to bitonic sorting, it is data dependent. Adaptive bitonic merging can be performed in O ( n p ) parallel time, p being the number of processors, and executes only O (...
متن کاملThe Bitonic Sorting Network
To establish a lower bound on the parceling number of S n we show that, under certain conditions , the parceling number of a graph is no less than the parceling number of its subgraph. For a directed graph G, G 0 is a convex sub-graph of G if for any directed path t of G whose endpoints are both in G 0 : all the nodes and edges of t are in G 0. Note, for example, that any slice of a dil-graph i...
متن کاملBitonic Sorting on Bene Networks
An algorithm derived from bitonic sorting networks and appropriate routings are presented which will sort a set of N inputs via a Beneš network. An expanded version of Knuth diagrams for sorting networks is also presented which illustrates the address line logic within the network.
متن کاملImproving Bitonic Sorting by Wire Elimination
We introduce a technique called wire elimination by which it is possible to remove wires and comparators from (n,m)merging and n-sorting circuits such that the resulting circuits are (n′,m′)-merging and n′-sorting circuits, resp., with n′ < n, m′ < m. By neatly choosing the wires to be removed, it is possible to obtain for n′ and m′ new circuits that have size less than circuits previously desi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2015
ISSN: 0975-8887
DOI: 10.5120/19890-1930